Gentzen-Type Formel System Representing Properties of Function and its Implementation
نویسندگان
چکیده
We d e s c r i b e a t h e o r e m p r o v e r (ca l led T K P 1), wh ich is based on a Gen tzentype f o r m a l sys tem [14) . T K P 1 can d i r e c t l y dea l w i t h func t iona ls and the c o m p o s i t i o n of f unc t i ona l s , i t c o m p r i s e s the f i xed point o p e r a t o r and a k i nd of f a c i l i t y fo r i n d u c t i o n . Le t us a t tempt to p rove P(F(x , y)) f o r F ( x , y ) such that F (x , y ) P r o v i d e d that P ( F ( x , y ) ) can be obta ined f r o m P f f n ( x , y ) ) n = 0, 1 , 2 , . . . , T K P 1 a u t o m a t i c a l l y g i ves the induc t ion hypothes is P ( f (x , y ) ) , and then prove P(f 1 ' ( x , y ) ) . It. can e f f i c i en t l y make p r o v i n g p r o c e d u r e for p r o p e r t i e s o f r e c u r s i v e p r o g r a m s . We can supply assumpt ions and de f i n i t i ons a t w i l l . T K P 1 d i sp lays an eas i ly read p r o o f f i g u r e .
منابع مشابه
Some Issues in Implementation of a Voltage Stability Analysis Function in an Energy Management System Environment
Over the last few years, the problem of voltage stability has received a lot of attraction from the power system community. This type of stability is now a major concern for utilities in both planning and operating conditions. Both static and dynamic aspects of the problem have been discussed and investigated by the researchers. The present paper concentrates on a Voltage Stability Analysis fun...
متن کاملClassical Gentzen-Type Methods in Propositional Many-Valued Logics
A classical Gentzen-type system is one which employs two-sided sequents, together with structural and logical rules of a certain characteristic form. A decent Gentzentype system should allow for direct proofs, which means that it should admit some useful forms of cut elimination and the subformula property. In this tutorial we explain the main difficulty in developing classical Gentzen-type sys...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملReasoning with Semantic Tableau Binary Trees in Description Logic
Authors of the Handbook of Description Logic present tableaux algorithms by means of a collection of so-called completion rules intended to generate a completion of ABox with respect to a corresponding TBox of a knowledge base S. An approach we present here is slightly modified. We use a set S of DL formulas of a knowledge base Σ containing DL formulas of ABox and transcriptions of definitions ...
متن کاملProposing an Appropriate Architecture for Decision Support Systems in the Field of Complex Chronic Care: Micro-Services Based Software Architecture in Kidney Transplant Care
Introduction: Development and successfully implementation of knowledge based clinical decision support system (KBCDSS) in kidney transplantation (KT) could support decision-making, reduce cost and improve quality of care. For practical use of these systems, however, many challenges have to be met. Besides to well-recognized challenges of design and implementation of information systems in heal...
متن کامل